Constrained BV functions on covering spaces for minimal networks and Plateau’s type problems∗
نویسندگان
چکیده
We link covering spaces with the theory of functions of bounded variation, in order to study minimal networks in the plane and Plateau’s problem without fixing a priori the topology of solutions. We solve the minimization problem in the class of (possibly vector-valued) BV functions defined on a covering space of the complement of an (n−2)-dimensional compact embedded Lipschitz manifold S without boundary. This approach has several similarities with Brakke’s “soap films” covering construction. The main novelty of our method stands in the presence of a suitable constraint on the fibers, which couples together the covering sheets. In the case of networks, the constraint is defined using a suitable subset of transpositions of m elements, m being the number of points of S. The model avoids all issues concerning the presence of the boundary S, which is automatically attained. The constraint is lifted in a natural way to Sobolev spaces, allowing also an approach based on Γ-convergence.
منابع مشابه
A hybrid GRASP algorithm for minimizing total weighted resource tardiness penalty costs in scheduling of project networks
In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a d...
متن کاملConstrained consumable resource allocation in alternative stochastic networks via multi-objective decision making
Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...
متن کاملLP problems constrained with D-FRIs
In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Dombi family of t-norms is considered as fuzzy composition. Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of ...
متن کاملOn The Fractional Minimal Cost Flow Problem of a Belief Degree Based Uncertain Network
A fractional minimal cost flow problem under linear type belief degree based uncertainty is studied for the first time. This type of uncertainty is useful when no historical information of an uncertain event is available. The problem is crisped using an uncertain chance-constrained programming approach and its non-linear objective function is linearized by a variable changing approach. An illus...
متن کامل$C$-class functions on common fixed point theorems for weak contraction mapping of integral type in modular spaces
In this paper, we use the concept of $C$-class functions introduced by Ansari [4] to prove the existence and uniqueness of common fixed point for self-mappings in modular spaces of integral inequality. Our results extended and generalized previous known results in this direction.
متن کامل